Generalized Groups that Distribute over Stars

نویسندگان

  • Harold Reiter
  • Arthur Holshouser
چکیده

In the paper “Groups that Distribute over Mathematical Structures”, [5], we stated that a group (S, ·) on a set S left (or right) distributes over an arbitrary mathematical structure (S, ∗) on the same set S if and only if respectively for all fixed t ∈ S the permutation Lt (x) = t · x (or Rt (x) = x · t) is a similarity mapping on (S, ∗). A similarity mapping f on (S, ∗) is a permutation on S that preserves the structure of (S, ∗) such as a homeomorphism on a topological space, an automorphism on a binary operator or a similarity mapping on a binary relation. Also, Lt (x) and Rt (x) are called the left and right translations by t. For example, the group (R, ◦,+) both left and right distributes over the space of real numbers (R, T ) with the usual topology. In other words, for all subsets U of R, and for all x ∈ R, U + x = x+U is an open subset of R if and only if U is an open subset of R. See [5] for the details. In this paper we define and give a reasonably complete solution for a naturally occurring example that involves what we call an n-star which is structurally the same as n lines in the plane intersecting in ( n 2 ) district points. However, an equally important purpose of this paper is to show that if a structure (S, ∗) is given, then a fundamental idea is to see if a group (S, ·) exists such that (S, ·) left-distributes or right-distributes over (S, ∗) . This paper takes the reader on a long journey, but we hope that it is a reasonably fast and easy journey.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Group-Oriented Generalized Secret Sharing Scheme with Cheater Detection

The generalized secret sharing scheme is a method used to divide secret into a set of participants such that only the qualified subsets of participants can reconstruct the secret. In this paper, we first propose a new generalized secret sharing scheme with cheater detection. The security of the scheme is based on discrete logarithm problem. Based on this scheme, we present a group-oriented gene...

متن کامل

GENERALIZED GORENSTEIN DIMENSION OVER GROUP RINGS

Let $(R, m)$ be a commutative noetherian local ring and let $Gamma$ be a finite group. It is proved that if $R$ admits a dualizing module, then the group ring $Rga$ has a dualizing bimodule as well. Moreover, it is shown that a finitely generated $Rga$-module $M$ has generalized Gorenstein dimension zero if and only if it has generalized Gorenstein dimension zero as an $R$-module.

متن کامل

Forty Years of X-Ray Binaries

In 2012 it was forty years ago that the discovery of the first X-ray binary Centaurus X-3 became known. That same year it was discovered that apart from the High-Mass X-ray Binaries (HMXBs) there are also Low-Mass X-ray Binaries (LMXBs), and that Cygnus X-1 is most probably a black hole. By 1975 also the new class of Be/X-ray binaries was discovered. After this it took 28 years before ESAs INTE...

متن کامل

Groups that Distribute over n-Stars

Suppose (S, ∗) is a mathematical structure on a set S. As examples, (S, ∗) might be a topological space on S, a topological group on S, an n-ary operator on S, an n-ary relation on S or a Steiner triple system on S. A similarity mapping on (S, ∗) is a permutation on S that preserves the structure of (S, ∗). Such mappings f : (S, ∗) → (S, ∗) are called by different names. As examples, f might be...

متن کامل

Graph product of generalized Cayley graphs over polygroups

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009